Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
نویسندگان
چکیده
منابع مشابه
Graphs of small bounded linear clique-width
In this paper we give the first characterisation of graphs with linear clique-width at most 3, and we give a polynomial-time recognition algorithm for such graphs. In addition, we give a new characterisation of graphs with linear clique-width at most 2 and a new layout characterisation of linear clique-width in general. Among our results is also a decomposition scheme that preserves the linear ...
متن کاملMinimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...
متن کاملMulticut on Graphs of Bounded Clique-Width
Several variants of Multicut problems arise in applications like circuit and network design. In general, these problems are NP-complete. The goal of our work is to investigate the potential of clique-width for identifying tractable fragments of Multicut. We show for several parameterizations involving clique-width whether they lead to tractability or not. Since bounded tree-width implies bounde...
متن کاملGraph Operations on Clique-Width Bounded Graphs
In this paper we survey the behavior of various graph operations on the graph parameters clique-width and NLC-width. We give upper and lower bounds for the clique-width and NLC-width of the modi ed graphs in terms of the clique-width and NLC-width of the involved graphs. Therefor we consider the binary graph operations join, co-join, sum, di erence, products, corona, substitution, and 1-sum, an...
متن کاملLine graphs of bounded clique-width
We show that a set of graphs has bounded tree-width or bounded path-width if and only if the corresponding set of line graphs has bounded clique-width or bounded linear clique-width, respectively. This relationship implies some interesting algorithmic properties and re-proves already known results in a very simpleway. It also shows that theminimization problem forNLC-width isNP-complete. © 2007...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2000
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s002249910009